منابع مشابه
Drawing Graphs Within Graphs
The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality. We introduce connection sets stressing relationships between several subgraphs. In a case study, we demonstrate how they ca...
متن کاملDrawing Graphs within Restricted Area
Abstract. We study the problem of selecting a maximum-weight subgraph of a given graph such that the subgraph can be drawn within a prescribed drawing area subject to given non-uniform vertex sizes. We develop and analyze heuristics both for the general (undirected) case and for the use case of (directed) calculation graphs which are used to analyze the typical mistakes that high school student...
متن کاملDrawing Graphs Within Graphs: A Contribution to the Graph Drawing Contest
This paper is a winning contribution to the Graph Drawing Contest 2003. The task of drawing subgraphs is often underestimated and subgraphs are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that layouts the subgraphs first and therefore increases their locality. We introduce connection sets emphasizing relationshi...
متن کاملDrawing outerplanar graphs
It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmovic, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments.
متن کاملDrawing Graphs with GLEE
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph layout with a given aspect ratio, an efficient method of edge-crossings counting while performing adjacent vertex swaps, and a simple and fast spline routing algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2005
ISSN: 1526-1719
DOI: 10.7155/jgaa.00097